| 1. | On the subtrees of random binary search trees
随机二叉搜索树的子树 |
| 2. | A binary search tree is a binary tree with the following properties
二进制搜索树( bst )是具有以下属性的二进制树： |
| 3. | Digital search tree
数字查找树 |
| 4. | Binary search tree
二叉查找树 |
| 5. | Binary search trees are useful for finding items in a list that changes infrequently
二叉搜索树在查找经常变化的列表时是很非常有用的。 |
| 6. | The algorithm provides the possibility of reducing the size of the search tree and running time
该算法从理论上提供了减小搜索树的规模及运行时间的可能性。 |
| 7. | Add and remove operations are typically expensive since binary search trees require that a tree be balanced
通常需要增加和删除操作，因为二叉树需要被平衡。 |
| 8. | Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently
二叉搜索树在查找经常变化的列表时是很非常有用的。 |
| 9. | Search tree , which is restricted by search depth , is the traditional algorithm in dealing with game
摘要解决博弈问题的传统算法搜索树法所无法克服的对搜索深度的限制。 |
| 10. | The experimentation proves that the game procedure designed by genetic algorithm outweighs that designed by search tree
实验表明，用遗传算法所设计的对弈程序优于搜索树法。 |
